Extended Deductive Databases with Uncertain Information
نویسندگان
چکیده
The paper presents an approach for handling uncertain information in deductive databases using multivalued logics. Uncertainty means that database facts may be assigned logical values other than the conventional ones true and false. The logical values represent various degrees of truth, which may be combined and propagated by applying the database rules. A corresponding multivalued database semantics is defined. We show that it extends successful conventional semantics as the well-founded semantics, and has a polynomial time data complexity. Keywords—Reasoning under uncertainty, multivalued logics, deductive databases, logic programs, multivalued semantics.
منابع مشابه
Modeling Uncertainty in Deductive Databases
Information Source Tracking (IST) method has been developed recently for the modeling and manipulation of uncertain and inaccurate data in relational databases. In this paper we extend the IST method to deductive databases. We show that positive uncertain databases, i.e. IST-based deductive databases with only positive literals in the heads and the bodies of the rules, enjoy a least model/least...
متن کاملAggregation in Disjunctive Deductive Databases
Practical applications of deductive databases often require the use of extended features like disjunctive information, aggregation operators or default negation. But it has been unclear how one could deal with aggregation in the presense of recursion and disjunction. Usually , there is the requirement that deductive databases must be stratiied w.r.t. aggregation, i.e. a predicate q that is deen...
متن کاملA Query Construct for Paraconsistent Databases
A data model has recently been developed for representing and manipulating two kinds of uncertain information in databases: incomplete and inconsistent. The model is based on 4-valued relations, called paraconsistent relations, and has already been employed for developing elegant methods for model computation of general deductive databases. Here, we present an SQL-like SELECT statement construc...
متن کاملHySpirit - A Probabilistic Inference Engine for Hypermedia Retrieval in Large Databases
HySpirit is a retrieval engine for hypermedia retrieval integrating concepts from information retrieval (IR) and deductive databases. The logical view on IR models retrieval as uncertain inference, for which we use probabilistic reasoning. Since the expressiveness of classical IR models is not suucient for hypermedia retrieval, HySpirit is based on a probabilistic version of Datalog. In hyperme...
متن کاملIntuitionistic Interpretation of Deductive Databases with Incomplete Information
Dong, F. and L.V.S. Lakshmanan, Intuitionistic interpretation of deductive databases with incomplete information, Theoretical Computer Science 133 (1994) 267-306. The aim of this paper is to build the relationship between deductive databases with incomplete information and hypothetical reasoning using embedded implications. We first consider the semantics of deductive databases with incomplete ...
متن کامل